Transitive closure

Results: 48



#Item
31Optimising Terminological Reasoning for Expressive Description Logics Dmitry Tsarkov, Ian Horrocks and Peter F. Patel-Schneider School of Computer Science University of Manchester, UK, and

Optimising Terminological Reasoning for Expressive Description Logics Dmitry Tsarkov, Ian Horrocks and Peter F. Patel-Schneider School of Computer Science University of Manchester, UK, and

Add to Reading List

Source URL: www.cs.man.ac.uk

Language: English - Date: 2007-07-26 07:53:30
32The Set Constraint/CFL Reachability Connection in Practice John Kodumal Alex Aiken

The Set Constraint/CFL Reachability Connection in Practice John Kodumal Alex Aiken

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2004-04-22 02:37:00
33Course Notes for Math 320: Fundamentals of Mathematics Chapter 4: Relations, Equivalence Relations and Congruence. March 14, 2006

Course Notes for Math 320: Fundamentals of Mathematics Chapter 4: Relations, Equivalence Relations and Congruence. March 14, 2006

Add to Reading List

Source URL: www.csun.edu

Language: English - Date: 2006-03-14 12:05:52
341993 Paper 11 Question 11  Discrete Mathematics Let A be a non-empty set, and ≺ be a relation on A. What is meant by saying that (A, ≺) is a partially ordered set? [3 marks]

1993 Paper 11 Question 11 Discrete Mathematics Let A be a non-empty set, and ≺ be a relation on A. What is meant by saying that (A, ≺) is a partially ordered set? [3 marks]

Add to Reading List

Source URL: www.cl.cam.ac.uk

Language: English - Date: 2014-06-09 10:16:52
35Inductively Finding a Reachable State Space Over-Approximation Michael L. Case Alan Mishchenko

Inductively Finding a Reachable State Space Over-Approximation Michael L. Case Alan Mishchenko

Add to Reading List

Source URL: www.bvsrc.org

Language: English - Date: 2006-05-01 16:01:54
36

PDF Document

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2009-07-21 19:18:57
37Event Matching Using the Transitive Closure of Dependency Relations Daniel M. Bikel and Vittorio Castelli IBM T. J. Watson Research Center 1101 Kitchawan Road Yorktown Heights, NY 10598 {dbikel,vittorio}@us.ibm.com

Event Matching Using the Transitive Closure of Dependency Relations Daniel M. Bikel and Vittorio Castelli IBM T. J. Watson Research Center 1101 Kitchawan Road Yorktown Heights, NY 10598 {dbikel,vittorio}@us.ibm.com

Add to Reading List

Source URL: www.aclweb.org

Language: English - Date: 2010-06-15 03:24:25
3815 Alice: Sergio: Alice: Riccardo: Vittorio:

15 Alice: Sergio: Alice: Riccardo: Vittorio:

Add to Reading List

Source URL: webdam.inria.fr

Language: English - Date: 2010-02-12 06:45:46
39Termination Analysis with Compositional Transition Invariants? Daniel Kroening1 , Natasha Sharygina2,4 , Aliaksei Tsitovich2 , and Christoph M. Wintersteiger3 1

Termination Analysis with Compositional Transition Invariants? Daniel Kroening1 , Natasha Sharygina2,4 , Aliaksei Tsitovich2 , and Christoph M. Wintersteiger3 1

Add to Reading List

Source URL: www.winterstiger.at

Language: English - Date: 2010-04-30 09:51:18
40Finding Botnets Using Minimal Graph Clusterings  Peter Haider [removed] Tobias Scheffer [removed]

Finding Botnets Using Minimal Graph Clusterings Peter Haider [removed] Tobias Scheffer [removed]

Add to Reading List

Source URL: icml.cc

Language: English - Date: 2012-06-07 13:20:18